Termination w.r.t. Q proof of TRS/SK902.29.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

prime(0) → false
prime(s(0)) → false
prime(s(s(x))) → prime1(s(s(x)), s(x))
prime1(x, 0) → false
prime1(x, s(0)) → true
prime1(x, s(s(y))) → and(not(divp(s(s(y)), x)), prime1(x, s(y)))
divp(x, y) → =(rem(x, y), 0)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

prime(0) → false
prime(s(0)) → false
prime(s(s(x))) → prime1(s(s(x)), s(x))
prime1(x, 0) → false
prime1(x, s(0)) → true
prime1(x, s(s(y))) → and(not(divp(s(s(y)), x)), prime1(x, s(y)))
divp(x, y) → =(rem(x, y), 0)

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

[prime₁, prime1_2] > false > [0, s₁, true, and₂, =_2]
[prime₁, prime1_2] > not₁ > [0, s₁, true, and₂, =_2]
[prime₁, prime1_2] > divp₂ > rem₂ > [0, s₁, true, and₂, =_2]

Status:

true: multiset
rem₂: multiset
prime₁: [1]
and₂: multiset
false: multiset
divp₂: multiset
0: multiset
s₁: multiset
=₂: [2,1]
prime1₂: [2,1]
not₁: multiset